On the Optimal Representation of Vector Location Using Fixed- Width Multi-precision Quantizers
نویسنده
چکیده
Current generation geospatial applications primarily rely on location representations that were developed for the manipulation and display of planar maps of portions of the earth’s surface. The next generation of digital earth applications will require fundamentally new technological approaches to location representation. Improvements in the efficiency of the representation of vector location can result in substantial performance increases. We examine the advantages and limitations of the most common current approach: as tuples of fixed-width floating point representations of real numbers, and identify a list of desirable design features for an optimal replacement system. These include the use of explicitly discrete integer indexes, the use of an optimal quantification scheme, and the ability to represent point locations at multiple precisions, including the capability to exactly represent key point locations, and the ability to encode multi-precision quantizations. We describe a class of planar systems that meet these criteria, which we call Central Place Indexing (CPI) systems. We then extend these systems to the sphere to provide a class of optimal known fixed-width geospatial vector location representation systems we call CPI43 systems.
منابع مشابه
A Vector Quantization Approach to Universal Noiseless Coding and Quantization - Information Theory, IEEE Transactions on
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may he noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to twostage coding, in which t...
متن کاملA vector quantization approach to universal noiseless coding and quantization
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may be noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to two-stage coding, in which ...
متن کاملQuantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network System
We propose a polynomial-time algorithm for optimal scalar quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained scalar quantizers, multi-resolution scalar quantizers, multiple description scalar quantizers, and Wyner-Ziv scalar quantizers. The algorithm guarantees globally optimal solutions fo...
متن کاملApproximating vector quantisation by transformation and scalar quantisation
Vector quantization provides better ratedistortion performance over scalar quantization even for a random vector with independent dimensions. However, the design and implementation complexity of vector quantizers is much higher than that of scalar quantizers. To reduce the complexity while achieving performance close to optimal vector quantization and better than scalar quantization, we propose...
متن کاملCodecell Contiguity in Optimal Fixed-Rate and Entropy-Constrained Network Scalar Quantizers
We consider the properties of optimal xed-rate and entropy-constrained scalar quantizers for nite alphabet sources. In particular, w econsider conditions under which the optimal scalar quantizer with contiguous codecells achieves performance no worse than the optimal scalar quantizer without the constraint of codecell contiguit y.In addition to traditional scalar quantizers, w econsider multi-r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013